| 1. Identity statement | |
| Reference Type | Conference Paper (Conference Proceedings) |
| Site | sibgrapi.sid.inpe.br |
| Holder Code | ibi 8JMKD3MGPEW34M/46T9EHH |
| Identifier | 8JMKD3MGPBW34M/387M46P |
| Repository | sid.inpe.br/sibgrapi/2010/09.06.14.05 |
| Last Update | 2010:09.06.14.05.16 (UTC) administrator |
| Metadata Repository | sid.inpe.br/sibgrapi/2010/09.06.14.05.16 |
| Metadata Last Update | 2022:06.14.00.06.58 (UTC) administrator |
| DOI | 10.1109/SIBGRAPI.2010.33 |
| Citation Key | NomaJr:2010:SpReEf |
| Title | Sparse Representations for Efficient Shape Matching  |
| Format | Printed, On-line. |
| Year | 2010 |
| Access Date | 2024, May 03 |
| Number of Files | 1 |
| Size | 521 KiB |
| 2. Context | |
| Author | 1 Noma, Alexandre 2 Jr, Roberto Marcondes Cesar |
| Affiliation | 1 Instituto de Matemática e Estatística - USP 2 Instituto de Matemática e Estatística - USP |
| Editor | Bellon, Olga Esperança, Claudio |
| e-Mail Address | alex.noma@gmail.com |
| Conference Name | Conference on Graphics, Patterns and Images, 23 (SIBGRAPI) |
| Conference Location | Gramado, RS, Brazil |
| Date | 30 Aug.-3 Sep. 2010 |
| Publisher | IEEE Computer Society |
| Publisher City | Los Alamitos |
| Book Title | Proceedings |
| Tertiary Type | Full Paper |
| History (UTC) | 2010-10-01 04:19:39 :: alex.noma@gmail.com -> administrator :: 2010 2022-06-14 00:06:58 :: administrator -> :: 2010 |
| 3. Content and structure | |
| Is the master or a copy? | is the master |
| Content Stage | completed |
| Transferable | 1 |
| Version Type | finaldraft |
| Keywords | point pattern matching graph matching quadratic assignment Markov random fields efficient belief propagation sparse shape representations shape metric 3D object recognition handwritten digits |
| Abstract | Graph matching is a fundamental problem with many applications in computer vision. Patterns are represented by graphs and pattern recognition corresponds to finding a correspondence between vertices from different graphs. In many cases, the problem can be formulated as a quadratic assignment problem, where the cost function consists of two components: a linear term representing the vertex compatibility and a quadratic term encoding the edge compatibility. The quadratic assignment problem is NP-hard and the present paper extends the approximation technique based on graph matching and efficient belief propagation described in previous work by using sparse representations for efficient shape matching. Successful results of recognition of 3D objects and handwritten digits are illustrated, using COIL and MNIST datasets, respectively. . |
| Arrangement 1 | urlib.net > SDLA > Fonds > SIBGRAPI 2010 > Sparse Representations for... |
| Arrangement 2 | urlib.net > SDLA > Fonds > Full Index > Sparse Representations for... |
| doc Directory Content | access |
| source Directory Content | there are no files |
| agreement Directory Content | there are no files |
| 4. Conditions of access and use | |
| data URL | http://urlib.net/ibi/8JMKD3MGPBW34M/387M46P |
| zipped data URL | http://urlib.net/zip/8JMKD3MGPBW34M/387M46P |
| Language | en |
| Target File | paper2.pdf |
| User Group | alex.noma@gmail.com |
| Visibility | shown |
| 5. Allied materials | |
| Next Higher Units | 8JMKD3MGPEW34M/46SJT6B 8JMKD3MGPEW34M/4742MCS |
| Citing Item List | sid.inpe.br/sibgrapi/2022/05.14.20.21 4 |
| Host Collection | sid.inpe.br/banon/2001/03.30.15.38 |
| 6. Notes | |
| Empty Fields | archivingpolicy archivist area callnumber contenttype copyholder copyright creatorhistory descriptionlevel dissemination documentstage edition electronicmailaddress group isbn issn label lineage mark mirrorrepository nextedition notes numberofvolumes orcid organization pages parameterlist parentrepositories previousedition previouslowerunit progress project readergroup readpermission resumeid rightsholder schedulinginformation secondarydate secondarykey secondarymark secondarytype serieseditor session shorttitle sponsor subject tertiarymark type url volume |